Relation between the Usual Order and the Enumeration Orders of Elements of r.e. Sets
نویسندگان
چکیده
In this paper, we have compared r.e. sets based on their enumeration orders with Turing machines. Accordingly, we have defined novel concept “uniformity” for Turing machines and r.e. sets and have studied some relationships between “uniformity” and both onereducibility and Turing reducibility. Furthermore, we have defined “type-2 uniformity” concept and studied r.e. sets and Turing machines based on this concept. In the end, we have introduced a new structure called “Turing Output Binary Search Tree” that helps us lighten some ideas.
منابع مشابه
Enumeration Order Equivalency
Definition 2.2 (Enumeration Order Reducibility on Listings and sets) 1. For listings , : we say is “Enumeration order reducible” to and write , if and only if, , ( . 2. For r.e. sets , , we say is “Enumeration order reducible” to and write , if and only if, for any listing of there exist some computable function (from the listings of to the listings of ) such that . 3. For two listings , (r.e. ...
متن کاملGraphs realised by r.e. equivalence relations
We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on ω. In particular we compare r.e. equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. ...
متن کاملRecursive and Recursively Enumerable
I. Basic concepts 1. Recursive enumerability and recursiveness. We consider infinite sequences of non-negative integers, free from repetitions. A familiar equivalence relation between such sequences is that based on sets: two sequences are equivalent when they enumerate the same set. The equivalence classes under this relation, with the necessary operations introduced, form a system isomorphic ...
متن کاملLattice of full soft Lie algebra
In this paper, we study the relation between the soft sets and soft Lie algebras with the lattice theory. We introduce the concepts of the lattice of soft sets, full soft sets and soft Lie algebras and next, we verify some properties of them. We prove that the lattice of the soft sets on a fixed parameter set is isomorphic to the power set of a ...
متن کاملA radical extension of the category of $S$-sets
Let S-Set be the category of $S$-sets, sets together with the actions of a semigroup $S$ on them. And, let S-Pos be the category of $S$-posets, posets together with the actions compatible with the orders on them. In this paper we show that the category S-Pos is a radical extension of S-Set; that is there is a radical on the category S-Pos, the order desolator radical, whose torsion-free class i...
متن کامل